0.03/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.13	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.13/0.35	% Computer   : n027.cluster.edu
0.13/0.35	% Model      : x86_64 x86_64
0.13/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory     : 8042.1875MB
0.13/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 1200
0.13/0.35	% WCLimit    : 120
0.13/0.35	% DateTime   : Tue Jul 13 11:15:55 EDT 2021
0.13/0.35	% CPUTime    : 
0.13/0.35	% Number of cores: 8
0.13/0.35	% Python version: Python 3.6.8
0.13/0.35	# Version: 2.6rc1-ho
0.13/0.35	# No SInE strategy applied
0.13/0.35	# Trying AutoSched0 for 59 seconds
0.20/0.47	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
0.20/0.47	# and selection function SelectUnlessUniqMax.
0.20/0.47	#
0.20/0.47	# Preprocessing time       : 0.028 s
0.20/0.47	# Presaturation interreduction done
0.20/0.47	
0.20/0.47	# Proof found!
0.20/0.47	# SZS status Theorem
0.20/0.47	# SZS output start CNFRefutation
0.20/0.47	thf(cTHM116_C_pme, conjecture, (![X1:a > $o, X2:a > $o]:(![X3:a]:(X2 @ X3=>X1 @ X3)=>![X3:a]:(cK @ X2 @ X3=>cK @ X1 @ X3))=>![X3:a]:(cK @ (^[X4:a]:?[X5:a > $o]:(X5 @ X4&![X6:a]:(X5 @ X6=>cK @ X5 @ X6))) @ X3<=>?[X5:a > $o]:(![X4:a]:(X5 @ X4=>cK @ X5 @ X4)&X5 @ X3))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cTHM116_C_pme)).
0.20/0.47	thf(c_0_1, plain, ![X4:a]:(epred1_1 @ X4<=>?[X5:a > $o]:(X5 @ X4&![X6:a]:(X5 @ X6=>cK @ X5 @ X6))), introduced(definition)).
0.20/0.47	thf(c_0_2, negated_conjecture, ~((![X1:a > $o, X2:a > $o]:(![X3:a]:(X2 @ X3=>X1 @ X3)=>![X3:a]:(cK @ X2 @ X3=>cK @ X1 @ X3))=>![X3:a]:(cK @ epred1_1 @ X3<=>?[X5:a > $o]:(![X4:a]:(X5 @ X4=>cK @ X5 @ X4)&X5 @ X3)))), inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM116_C_pme]), c_0_1])).
0.20/0.47	thf(c_0_3, negated_conjecture, ![X14:a > $o, X15:a > $o, X17:a, X19:a > $o, X22:a]:(((X15 @ (esk1_2 @ X14 @ X15)|(~cK @ X15 @ X17|cK @ X14 @ X17))&(~X14 @ (esk1_2 @ X14 @ X15)|(~cK @ X15 @ X17|cK @ X14 @ X17)))&(((X19 @ (esk3_1 @ X19)|~X19 @ esk2_0|~cK @ epred1_1 @ esk2_0)&(~cK @ X19 @ (esk3_1 @ X19)|~X19 @ esk2_0|~cK @ epred1_1 @ esk2_0))&((~epred2_0 @ X22|cK @ epred2_0 @ X22|cK @ epred1_1 @ esk2_0)&(epred2_0 @ esk2_0|cK @ epred1_1 @ esk2_0)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])).
0.20/0.47	thf(c_0_4, plain, ![X23:a, X25:a, X26:a, X27:a > $o]:(((epred3_1 @ X23 @ X23|~epred1_1 @ X23)&(~epred3_1 @ X23 @ X25|cK @ (epred3_1 @ X23) @ X25|~epred1_1 @ X23))&((X27 @ (esk4_2 @ X26 @ X27)|~X27 @ X26|epred1_1 @ X26)&(~cK @ X27 @ (esk4_2 @ X26 @ X27)|~X27 @ X26|epred1_1 @ X26))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])).
0.20/0.47	thf(c_0_5, negated_conjecture, ![X1:a > $o, X2:a > $o, X3:a]:(X1 @ (esk1_2 @ X2 @ X1)|cK @ X2 @ X3|~cK @ X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_3])).
0.20/0.47	thf(c_0_6, plain, ![X4:a, X3:a]:(cK @ (epred3_1 @ X3) @ X4|~epred3_1 @ X3 @ X4|~epred1_1 @ X3), inference(split_conjunct,[status(thm)],[c_0_4])).
0.20/0.47	thf(c_0_7, plain, ![X1:a > $o, X3:a]:(epred1_1 @ X3|~cK @ X1 @ (esk4_2 @ X3 @ X1)|~X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_4])).
0.20/0.47	thf(c_0_8, plain, ![X1:a > $o, X3:a]:(X1 @ (esk4_2 @ X3 @ X1)|epred1_1 @ X3|~X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_4])).
0.20/0.47	thf(c_0_9, plain, ![X1:a > $o, X4:a, X3:a]:(epred3_1 @ X3 @ (esk1_2 @ X1 @ (epred3_1 @ X3))|cK @ X1 @ X4|~epred3_1 @ X3 @ X4|~epred1_1 @ X3), inference(spm,[status(thm)],[c_0_5, c_0_6])).
0.20/0.47	thf(c_0_10, plain, ![X3:a]:(epred3_1 @ X3 @ X3|~epred1_1 @ X3), inference(split_conjunct,[status(thm)],[c_0_4])).
0.20/0.47	thf(c_0_11, plain, ![X3:a, X4:a]:(epred1_1 @ X3|~epred3_1 @ X4 @ X3|~epred1_1 @ X4), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_6]), c_0_8])).
0.20/0.47	thf(c_0_12, plain, ![X1:a > $o, X3:a]:(epred3_1 @ X3 @ (esk1_2 @ X1 @ (epred3_1 @ X3))|cK @ X1 @ X3|~epred1_1 @ X3), inference(spm,[status(thm)],[c_0_9, c_0_10])).
0.20/0.47	thf(c_0_13, negated_conjecture, ![X1:a > $o]:(~cK @ X1 @ (esk3_1 @ X1)|~X1 @ esk2_0|~cK @ epred1_1 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_3])).
0.20/0.47	thf(c_0_14, negated_conjecture, ![X1:a > $o]:(X1 @ (esk3_1 @ X1)|~X1 @ esk2_0|~cK @ epred1_1 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_3])).
0.20/0.47	thf(c_0_15, negated_conjecture, ![X1:a > $o, X2:a > $o, X3:a]:(cK @ X1 @ X3|~X1 @ (esk1_2 @ X1 @ X2)|~cK @ X2 @ X3), inference(split_conjunct,[status(thm)],[c_0_3])).
0.20/0.47	thf(c_0_16, plain, ![X1:a > $o, X3:a]:(epred1_1 @ (esk1_2 @ X1 @ (epred3_1 @ X3))|cK @ X1 @ X3|~epred1_1 @ X3), inference(spm,[status(thm)],[c_0_11, c_0_12])).
0.20/0.47	thf(c_0_17, negated_conjecture, ![X3:a]:(~cK @ epred1_1 @ esk2_0|~epred3_1 @ X3 @ esk2_0|~epred1_1 @ X3), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_6]), c_0_14])).
0.20/0.47	thf(c_0_18, negated_conjecture, ![X4:a, X3:a]:(cK @ epred1_1 @ X3|cK @ epred1_1 @ X4|~cK @ (epred3_1 @ X3) @ X4|~epred1_1 @ X3), inference(spm,[status(thm)],[c_0_15, c_0_16])).
0.20/0.47	thf(c_0_19, plain, (~cK @ epred1_1 @ esk2_0|~epred1_1 @ esk2_0), inference(spm,[status(thm)],[c_0_17, c_0_10])).
0.20/0.47	thf(c_0_20, negated_conjecture, (epred2_0 @ esk2_0|cK @ epred1_1 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_3])).
0.20/0.47	thf(c_0_21, plain, ![X3:a, X4:a]:(cK @ epred1_1 @ X3|cK @ epred1_1 @ X4|~epred3_1 @ X4 @ X3|~epred1_1 @ X4), inference(spm,[status(thm)],[c_0_18, c_0_6])).
0.20/0.47	thf(c_0_22, plain, ![X1:a > $o, X2:a > $o, X3:a]:(cK @ X1 @ (esk4_2 @ X3 @ (cK @ X2))|X2 @ (esk1_2 @ X1 @ X2)|epred1_1 @ X3|~cK @ X2 @ X3), inference(spm,[status(thm)],[c_0_5, c_0_8])).
0.20/0.47	thf(c_0_23, negated_conjecture, (epred2_0 @ esk2_0|~epred1_1 @ esk2_0), inference(spm,[status(thm)],[c_0_19, c_0_20])).
0.20/0.47	thf(c_0_24, plain, ![X3:a]:(cK @ epred1_1 @ X3|~epred1_1 @ X3), inference(spm,[status(thm)],[c_0_21, c_0_10])).
0.20/0.47	thf(c_0_25, negated_conjecture, ![X1:a > $o]:(cK @ X1 @ (esk4_2 @ esk2_0 @ (cK @ epred1_1))|epred1_1 @ (esk1_2 @ X1 @ epred1_1)|epred2_0 @ esk2_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_20]), c_0_23])).
0.20/0.47	thf(c_0_26, negated_conjecture, ![X1:a > $o, X3:a]:(cK @ (cK @ epred1_1) @ X3|~epred1_1 @ (esk1_2 @ (cK @ epred1_1) @ X1)|~cK @ X1 @ X3), inference(spm,[status(thm)],[c_0_15, c_0_24])).
0.20/0.47	thf(c_0_27, plain, (epred1_1 @ (esk1_2 @ (cK @ epred1_1) @ epred1_1)|epred2_0 @ esk2_0), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_25]), c_0_20]), c_0_23])).
0.20/0.47	thf(c_0_28, plain, ![X3:a]:(cK @ (cK @ epred1_1) @ X3|epred2_0 @ esk2_0|~cK @ epred1_1 @ X3), inference(spm,[status(thm)],[c_0_26, c_0_27])).
0.20/0.47	thf(c_0_29, negated_conjecture, ![X3:a]:(cK @ epred2_0 @ X3|cK @ epred1_1 @ esk2_0|~epred2_0 @ X3), inference(split_conjunct,[status(thm)],[c_0_3])).
0.20/0.47	thf(c_0_30, negated_conjecture, (epred2_0 @ esk2_0|~cK @ epred1_1 @ (esk3_1 @ (cK @ epred1_1))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_28]), c_0_20])).
0.20/0.47	thf(c_0_31, negated_conjecture, ![X3:a]:(cK @ epred1_1 @ esk2_0|epred1_1 @ X3|~epred2_0 @ X3), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_8]), c_0_7])).
0.20/0.47	thf(c_0_32, negated_conjecture, epred2_0 @ esk2_0, inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_14]), c_0_20])).
0.20/0.47	thf(c_0_33, plain, ~epred1_1 @ esk2_0, inference(spm,[status(thm)],[c_0_19, c_0_24])).
0.20/0.47	thf(c_0_34, negated_conjecture, ![X1:a > $o, X2:a > $o]:(cK @ X1 @ (esk3_1 @ (cK @ X2))|X2 @ (esk1_2 @ X1 @ X2)|~cK @ epred1_1 @ esk2_0|~cK @ X2 @ esk2_0), inference(spm,[status(thm)],[c_0_5, c_0_14])).
0.20/0.47	thf(c_0_35, negated_conjecture, cK @ epred1_1 @ esk2_0, inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32]), c_0_33])).
0.20/0.47	thf(c_0_36, negated_conjecture, ![X1:a > $o, X2:a > $o]:(cK @ X1 @ (esk3_1 @ (cK @ X2))|X2 @ (esk1_2 @ X1 @ X2)|~cK @ X2 @ esk2_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34, c_0_35])])).
0.20/0.47	thf(c_0_37, negated_conjecture, ![X1:a > $o]:(cK @ X1 @ (esk3_1 @ (cK @ epred1_1))|epred1_1 @ (esk1_2 @ X1 @ epred1_1)), inference(spm,[status(thm)],[c_0_36, c_0_35])).
0.20/0.47	thf(c_0_38, negated_conjecture, ![X3:a]:(cK @ (cK @ epred1_1) @ (esk3_1 @ (cK @ epred1_1))|cK @ (cK @ epred1_1) @ X3|~cK @ epred1_1 @ X3), inference(spm,[status(thm)],[c_0_26, c_0_37])).
0.20/0.47	thf(c_0_39, negated_conjecture, ![X1:a > $o]:(X1 @ (esk3_1 @ X1)|~X1 @ esk2_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14, c_0_35])])).
0.20/0.47	thf(c_0_40, negated_conjecture, ![X1:a > $o]:(~cK @ X1 @ (esk3_1 @ X1)|~X1 @ esk2_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_35])])).
0.20/0.47	thf(c_0_41, negated_conjecture, cK @ (cK @ epred1_1) @ (esk3_1 @ (cK @ epred1_1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_39]), c_0_35])])).
0.20/0.47	thf(c_0_42, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_41]), c_0_35])]), ['proof']).
0.20/0.47	# SZS output end CNFRefutation
0.20/0.47	# Proof object total steps             : 43
0.20/0.47	# Proof object clause steps            : 38
0.20/0.47	# Proof object formula steps           : 5
0.20/0.47	# Proof object conjectures             : 26
0.20/0.47	# Proof object clause conjectures      : 23
0.20/0.47	# Proof object formula conjectures     : 3
0.20/0.47	# Proof object initial clauses used    : 10
0.20/0.47	# Proof object initial formulas used   : 1
0.20/0.47	# Proof object generating inferences   : 25
0.20/0.47	# Proof object simplifying inferences  : 19
0.20/0.47	# Training examples: 0 positive, 0 negative
0.20/0.47	# Parsed axioms                        : 3
0.20/0.47	# Removed by relevancy pruning/SinE    : 0
0.20/0.47	# Initial clauses                      : 12
0.20/0.47	# Removed in clause preprocessing      : 2
0.20/0.47	# Initial clauses in saturation        : 10
0.20/0.47	# Processed clauses                    : 521
0.20/0.47	# ...of these trivial                  : 2
0.20/0.47	# ...subsumed                          : 136
0.20/0.47	# ...remaining for further processing  : 383
0.20/0.47	# Other redundant clauses eliminated   : 202
0.20/0.47	# Clauses deleted for lack of memory   : 0
0.20/0.47	# Backward-subsumed                    : 150
0.20/0.47	# Backward-rewritten                   : 85
0.20/0.47	# Generated clauses                    : 2608
0.20/0.47	# ...of the previous two non-trivial   : 1165
0.20/0.47	# Contextual simplify-reflections      : 135
0.20/0.47	# Paramodulations                      : 966
0.20/0.47	# Factorizations                       : 0
0.20/0.47	# NegExts                              : 44
0.20/0.47	# Equation resolutions                 : 202
0.20/0.47	# Propositional unsat checks           : 0
0.20/0.47	#    Propositional check models        : 0
0.20/0.47	#    Propositional check unsatisfiable : 0
0.20/0.47	#    Propositional clauses             : 0
0.20/0.47	#    Propositional clauses after purity: 0
0.20/0.47	#    Propositional unsat core size     : 0
0.20/0.47	#    Propositional preprocessing time  : 0.000
0.20/0.47	#    Propositional encoding time       : 0.000
0.20/0.47	#    Propositional solver time         : 0.000
0.20/0.47	#    Success case prop preproc time    : 0.000
0.20/0.47	#    Success case prop encoding time   : 0.000
0.20/0.47	#    Success case prop solver time     : 0.000
0.20/0.47	# Current number of processed clauses  : 107
0.20/0.47	#    Positive orientable unit clauses  : 4
0.20/0.47	#    Positive unorientable unit clauses: 0
0.20/0.47	#    Negative unit clauses             : 2
0.20/0.47	#    Non-unit-clauses                  : 101
0.20/0.47	# Current number of unprocessed clauses: 573
0.20/0.47	# ...number of literals in the above   : 3615
0.20/0.47	# Current number of archived formulas  : 0
0.20/0.47	# Current number of archived clauses   : 276
0.20/0.47	# Clause-clause subsumption calls (NU) : 25751
0.20/0.47	# Rec. Clause-clause subsumption calls : 2572
0.20/0.47	# Non-unit clause-clause subsumptions  : 388
0.20/0.47	# Unit Clause-clause subsumption calls : 396
0.20/0.47	# Rewrite failures with RHS unbound    : 0
0.20/0.47	# BW rewrite match attempts            : 4
0.20/0.47	# BW rewrite match successes           : 4
0.20/0.47	# Condensation attempts                : 0
0.20/0.47	# Condensation successes               : 0
0.20/0.47	# Termbank termtop insertions          : 41337
0.20/0.47	
0.20/0.47	# -------------------------------------------------
0.20/0.47	# User time                : 0.114 s
0.20/0.47	# System time              : 0.005 s
0.20/0.47	# Total time               : 0.119 s
0.20/0.47	# Maximum resident set size: 1648 pages
0.20/0.47	EOF